ARPA Whitepaper

We propose a secure computation solution for blockchain networks. The correctness of computation is verifiable even under malicious majority condition using information-theoretic Message Authentication Code (MAC), and the privacy is preserved using Secret-Sharing. With state-of-the-art multiparty computation protocol and a layer2 solution, our privacy-preserving computation guarantees data security on blockchain, cryptographically, while reducing the heavy-lifting computation job to a few nodes. This breakthrough has several implications on the future of decentralized networks. First, secure computation can be used to support Private Smart Contracts, where consensus is reached without exposing the information in the public contract. Second, it enables data to be shared and used in trustless network, without disclosing the raw data during data-at-use, where data ownership and data usage is safely separated. Last but not least, computation and verification processes are separated, which can be perceived as computational sharding, this effectively makes the transaction processing speed linear to the number of participating nodes. Our objective is to deploy our secure computation network as an layer2 solution to any blockchain system. Smart Contracts\cite{smartcontract} will be used as bridge to link the blockchain and computation networks. Additionally, they will be used as verifier to ensure that outsourced computation is completed correctly. In order to achieve this, we first develop a general MPC network with advanced features, such as: 1) Secure Computation, 2) Off-chain Computation, 3) Verifiable Computation, and 4)Support dApps' needs like privacy-preserving data exchange

Discordance between cosmogenic nuclide concentrations in amalgamated sands and individual fluvial pebbles in an arid zone catchment

Based on cosmogenic 10Be and 26Al analyses in 15 individual detrital quartz pebbles (16–21 mm) and cosmogenic 10Be in amalgamated medium sand (0.25–0.50 mm), all collected from the outlet of the upper Gaub River catchment in Namibia, quartz pebbles yield a substantially lower average denudation rate than those yielded by the amalgamated sand sample. 10Be and 26Al concentrations in the 15 individual pebbles span nearly two orders of magnitude (0.22 ± 0.01 to 20.74 ± 0.52 × 10610Be atoms g−1 and 1.35 ± 0.09 to 72.76 ± 2.04 × 10626Al atoms g−1, respectively) and yield average denudation rates of ∼0.7 m Myr−1 (10Be) and ∼0.9 m Myr−1 (26Al). In contrast, the amalgamated sand yields an average 10Be concentration of 0.77 ± 0.03 × 106 atoms g−1, and an associated mean denudation rate of 9.6 ± 1.1 m Myr−1, an order of magnitude greater than the rates obtained for the amalgamated pebbles. The inconsistency between the 10Be and 26Al in the pebbles and the 10Be in the amalgamated sand is likely due to the combined effect of differential sediment sourcing and longer sediment transport times for the pebbles compared to the sand-sized grains. The amalgamated sands leaving the catchment are an aggregate of grains originating from all quartz-bearing rocks in all parts of the catchment. Thus, the cosmogenic nuclide inventories of these sands record the overall average lowering rate of the landscape. The pebbles originate from quartz vein outcrops throughout the catchment, and the episodic erosion of the latter means that the pebbles will have higher nuclide inventories than the surrounding bedrock and soil, and therefore also higher than the amalgamated sand grains. The order-of-magnitude grain size bias observed in the Gaub has important implications for using cosmogenic nuclide abundances in depositional surfaces because in arid environments, akin to our study catchment, pebble-sized clasts yield substantially underestimated palaeo-denudation rates. Our results highlight the importance of carefully considering geomorphology and grain size when interpreting cosmogenic nuclide data in depositional surfaces

Can NLI Provide Proper Indirect Supervision for Low-resource Biomedical Relation Extraction?

Two key obstacles in biomedical relation extraction (RE) are the scarcity of annotations and the prevalence of instances without explicitly pre-defined labels due to low annotation coverage. Existing approaches, which treat biomedical RE as a multi-class classification task, often result in poor generalization in low-resource settings and do not have the ability to make selective prediction on unknown cases but give a guess from seen relations, hindering the applicability of those approaches. We present NBR, which converts biomedical RE as natural language inference formulation through indirect supervision. By converting relations to natural language hypotheses, NBR is capable of exploiting semantic cues to alleviate annotation scarcity. By incorporating a ranking-based loss that implicitly calibrates abstinent instances, NBR learns a clearer decision boundary and is instructed to abstain on uncertain instances. Extensive experiments on three widely-used biomedical RE benchmarks, namely ChemProt, DDI and GAD, verify the effectiveness of NBR in both full-set and low-resource regimes. Our analysis demonstrates that indirect supervision benefits biomedical RE even when a domain gap exists, and combining NLI knowledge with biomedical knowledge leads to the best performance gains.Comment: 16 pages; ACL 2023; code in https://github.com/luka-group/NLI_as_Indirect_Supervisio

Detecting Small Query Graphs in A Large Graph via Neural Subgraph Search

Recent advances have shown the success of using reinforcement learning and search to solve NP-hard graph-related tasks, such as Traveling Salesman Optimization, Graph Edit Distance computation, etc. However, it remains unclear how one can efficiently and accurately detect the occurrences of a small query graph in a large target graph, which is a core operation in graph database search, biomedical analysis, social group finding, etc. This task is called Subgraph Matching which essentially performs subgraph isomorphism check between a query graph and a large target graph. One promising approach to this classical problem is the "learning-to-search" paradigm, where a reinforcement learning (RL) agent is designed with a learned policy to guide a search algorithm to quickly find the solution without any solved instances for supervision. However, for the specific task of Subgraph Matching, though the query graph is usually small given by the user as input, the target graph is often orders-of-magnitude larger. It poses challenges to the neural network design and can lead to solution and reward sparsity. In this paper, we propose NSUBS with two innovations to tackle the challenges: (1) A novel encoder-decoder neural network architecture to dynamically compute the matching information between the query and the target graphs at each search state; (2) A novel look-ahead loss function for training the policy network. Experiments on six large real-world target graphs show that NSUBS can significantly improve the subgraph matching performance

Application of Peer-Assisted Learning in a University Extra-Curricular Program

This project assessed an extracurricular peer-assisted learning program entitled the English Language Buddy Scheme established at the Hong Kong University of Science and Technology. Our project focused on the effectiveness of the types of activities administered, organizational structure and its potential benefits. Analysis of existing documentation, a participant survey, and interviews with organizational staff provided recommendations to future implementations. Recommendations include returning to a central documentation system, supporting identified effective activities, and investigating effects of group size and problem-solving activities

Evidence for rapid paraglacial formation of rock glaciers in southern Norway from 10Be surface-exposure dating

We evaluate the timing and environmental controls on past rock-glacier activity at Øyberget, upper Ottadalen, southern Norway, using in situ 10Be surface-exposure dating on (1) boulders belonging to relict rock-glacier lobes at c. 530 m asl, (2) bedrock and boulder surfaces at the Øyberget summit (c. 1200 m asl), and (3) bedrock at an up-valley site (c. 615 m asl). We find that the rock-glacier lobes became inactive around 11.1 ± 1.2 ka, coeval with the timing of summit deglaciation (11.2 ± 0.7 ka). This is slightly older than previously published Schmidt-hammer surface-exposure ages. The timing does not match known climatic conditions promoting rock-glacier formation in the early Holocene; hence we infer that lobe formation resulted from enhanced debris supply and burial of residual ice during and soon after deglaciation. The results demonstrate that rock glaciers may form over a relatively short period of time (hundreds rather than thousands of years) under non-permafrost conditions and possibly indicate a paraglacial type of process

Widespread erosion on high plateaus during recent glaciations in Scandinavia

Glaciers create some of Earth’s steepest topography; yet, many areas that were repeatedly overridden by ice sheets in the last few million years include extensive plateaus. The distinct geomorphic contrast between plateaus and the glacial troughs that dissect them has sustained two long-held hypotheses: first, that ice sheets perform insignificant erosion beyond glacial troughs, and, second, that the plateaus represent ancient pre-glacial landforms bearing information of tectonic and geomorphic history prior to Pliocene–Pleistocene global cooling (~3.5 Myr ago). Here we show that the Fennoscandian ice sheets drove widespread erosion across plateaus far beyond glacial troughs. We apply inverse modelling to 118 new cosmogenic 10Be and 26Al measurements to quantify ice sheet erosion on the plateaus fringing the Sognefjorden glacial trough in western Norway. Our findings demonstrate substantial modification of the pre-glacial landscape during the Quaternary, and that glacial erosion of plateaus is important when estimating the global sediment flux to the oceans

Implementation-Oblivious Transparent Checkpoint-Restart for MPI

This work presents experience with traditional use cases of checkpointing on a novel platform. A single codebase (MANA) transparently checkpoints production workloads for major available MPI implementations: "develop once, run everywhere". The new platform enables application developers to compile their application against any of the available standards-compliant MPI implementations, and test each MPI implementation according to performance or other features.Comment: 17 pages, 4 figure